Approximated Distributed Minimum Vertex Cover Algorithms for Bounded Degree Graphs

In this paper, two distributed algorithms for the minimum vertex cover problem are given. In the unweighted case, we propose a 2.5-approximation algorithm with round complexity O(∆), where ∆ is the maximal degree of G, improving the previous 3-approximation result with the same round complexity O(∆). For the weighted case, we give a 4-approximation algorithm with round complexity O(∆).